Structured doubling algorithms for solving g-palindromic quadratic eigenvalue problems∗
نویسندگان
چکیده
The T-palindromic quadratic eigenvalue problem (λB + λC + A)x = 0, with A,B,C ∈ Cn×n, C = C and B = A, governs the vibration behavior of trains. One way to solve the problem is to apply a structure-preserving doubling algorithm (SDA) to the nonlinear matrix equation (NME) X + BX−1A = C and “square-root” the matrix quadratic involved. In this paper, we generalize the SDA for the solution of (odd and even) Tand H-palindromic quadratic eigenvalue problems in a unified fashion. A convergence proof and several numerical examples are provided.
منابع مشابه
Structure-Preserving Algorithms for Palindromic Quadratic Eigenvalue Problems Arising from Vibration of Fast Trains
In this paper, based on Patel’s algorithm (1993), we proposed a structure-preserving algorithm for solving palindromic quadratic eigenvalue problems (QEPs). We also show the relationship between the structure-preserving algorithm and the URV-based structure-preserving algorithm by Schröder (2007). For large sparse palindromic QEPs, we develop a generalized >skew-Hamiltonian implicity-restarted ...
متن کاملAn Improved Structure- Preserving Doubling Algorithm For a Structured Palindromic Quadratic Eigenvalue Problem
In this paper, we present a numerical method to solve the palindromic quadratic eigenvalue problem (PQEP) (λA+λQ+A)z = 0 arising from the vibration analysis of high speed trains, where A, Q ∈ Cn×n have special structures: both Q and A are m × m block matrices with each block being k × k, and moreover they are complex symmetric, block tridiagonal and block Toeplitz, and also A has only one nonze...
متن کاملA new look at the doubling algorithm for a structured palindromic quadratic eigenvalue problem
Recently, Guo and Lin [SIAM J. Matrix Anal. Appl., 31 (2010), 2784–2801] proposed an efficient numerical method to solve the palindromic quadratic eigenvalue problem (PQEP) . 2ATC QCA/ ́ D 0 arising from the vibration analysis of high speed trains, where A; Q 2 C n have special structures: both Q and A are, among others, m m block matrices with each block being k k (thus, n D mk), and moreover, ...
متن کاملSolving a Structured Quadratic Eigenvalue Problem by a Structure-Preserving Doubling Algorithm
In studying the vibration of fast trains, we encounter a palindromic quadratic eigenvalue problem (QEP) (λ2AT +λQ+A)z = 0, where A,Q ∈ Cn×n and QT = Q. Moreover, the matrix Q is block tridiagonal and block Toeplitz, and the matrix A has only one nonzero block in the upperright corner. So most of the eigenvalues of the QEP are zero or infinity. In a linearization approach, one typically starts w...
متن کاملSymplectic, BVD, and Palindromic Approaches to Discrete-Time Control Problems¶
We give several different formulations for the discrete-time linear-quadratic control problem in terms of structured eigenvalue problems, and discuss the relationships among the associated structured objects: symplectic matrices and pencils, BVD-pencils and polynomials, and the recently introduced classes of palindromic pencils and matrix polynomials. We show how these structured objects can be...
متن کامل